Sparse polynomial prediction

نویسندگان

چکیده

Abstract In numerical analysis, sparse grids are point configurations used in stochastic finite element approximation, integration and interpolation. This paper is concerned with the construction of polynomial interpolator models grids. Our proposal stems from fact that a grid an echelon design hierarchical structure identifies single model. We then formulate model show it can be written using inclusion–exclusion formulæ. At this point, we deploy efficient methodologies algebraic literature simplify considerably computations. The methodology uses Betti numbers to reduce number terms while achieving same result as exhaustive

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Sparse Polynomial Systems

Abstract Let f :=(f1, . . . , fn) be a sparse random polynomial system. This means that each f i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express the expected number of roots of f inside a region U as the integral over U of a certain mixed volume form. When U = (C∗)n, the classical mixed vol...

متن کامل

Sparse Polynomial Decomposition

Polynomial decomposition is an important field of symbolic manipulation, and has been well-studied for the case of densely-represented polynomials, resulting in algorithms with near-linear complexity. Polynomial decomposition is supported in most computer algebra packages such as Maple, and in fact decompositions can be used to simplify some other algebraic problems. For instance, to find the r...

متن کامل

Sparse Polynomial Exponential Sums

(1.2) f(x) = a1x k1 + · · ·+ arx with 0 < k1 < k2 < · · · < kr. We assume always that the content of f , (a1, a2, . . . , ar), is relatively prime to the modulus q. Let d = d(f) = kr denote the degree of f and for any prime p let dp(f) denote the degree of f read modulo p. A fundamental problem is to determine whether there exists an absolute constant C such that for an arbitrary positive integ...

متن کامل

Learning Sparse Polynomial Functions

We study the question of learning a sparse multivariate polynomial over the real domain. In particular, for some unknown polynomial f(~x) of degree-d and k monomials, we show how to reconstruct f , within error , given only a set of examples x̄i drawn uniformly from the n-dimensional cube (or an n-dimensional Gaussian distribution), together with evaluations f(x̄i) on them. The result holds even ...

متن کامل

Sparse Polynomial Powering Using Heaps

We modify an old algorithm for expanding powers of dense polynomials to make it work for sparse polynomials, by using a heap to sort monomials. It has better complexity and lower space requirements than other sparse powering algorithms for dense polynomials. We show how to parallelize the method, and compare its performance on a series of benchmark problems to other methods and the Magma and Si...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistical papers

سال: 2023

ISSN: ['2412-110X', '0250-9822']

DOI: https://doi.org/10.1007/s00362-023-01439-8